منابع مشابه
Learning Sparse Causal Models is not NP-hard
This paper shows that causal model discovery is not an NP-hard problem, in the sense that for sparse graphs bounded by node degree k the sound and complete causal model can be obtained in worst case order N independence tests, even when latent variables and selection bias may be present. We present a modification of the well-known FCI algorithm that implements the method for an independence ora...
متن کاملSupplement - Learning Sparse Causal Models is not NP-hard
This article contains detailed proofs and additional examples related to the UAI-2013 submission ‘Learning Sparse Causal Models is not NP-hard’. The supplement follows the numbering in the main submission.
متن کاملOptimal State Amalgamation is NP-Hard
A state amalgamation of a directed graph is a node contraction which is only permitted under certain configurations of incident edges. In symbolic dynamics, state amalgamation and its inverse operation, state splitting, play a fundamental role in the the theory of subshifts of finite type (SFT): any conjugacy between SFTs, given as vertex shifts, can be expressed as a sequence of symbol splitti...
متن کاملOptimal Art Gallery Localization is NP-hard
Art Gallery Localization (AGL) is the problem of placing a set T of broadcast towers in a simple polygon P in order for a point to locate itself in the interior. For any point p ∈ P : for each tower t ∈ T ∩ V (p) (where V (p) denotes the visibility polygon of p) the point p receives the coordinates of t and the Euclidean distance between t and p. From this information p can determine its coordi...
متن کاملOptimal CQ Reformulation is NP-Hard
As a consequence of the Subgoal Theorem and the Projection Lemma, we need only consider projection views that are defined in terms of subgoals. Unfortunately, despite these improvements, we show that the optimization problem is still NP-Hard in the number of subgoals and free variables in the input query. Our proof strategy is as follows. First, we prune the space of potential reformulations by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2018
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.97.020103